Quasi-Random Sequences and Their Discrepancies

نویسندگان

  • William J. Morokoff
  • Russel E. Caflisch
چکیده

Quasi-random (also called low discrepancy) sequences are a deterministic alternative to random sequences for use in Monte Carlo methods, such as integration and particle simulations of transport processes. The error in uniformity for such a sequence of N points in the s-dimensional unit cube is measured by its discrepancy, which is of size (log N) N-Ifor large N, as opposed to discrepancy of size (log log N) 1/2 N-1/2 for a random sequence (i.e., for almost any randomly chosen sequence). Several types of discrepancies, one of which is new, are defined and analyzed. A critical discussion of the theoretical bounds on these discrepancies is presented. Computations of discrepancies are presented for a wide choice of dimension s, number of points N, and different quasi-random sequences. In particular for moderate or large s, there is an intermediate regime in which the discrepancy of a quasi-random sequence is almost exactly the same as that of a randomly chosen sequence. A simplified proof is given for Woniakowski's result relating discrepancy and average integration error, and this result is generalized to other measures on function space. 1. Introduction. Since the beginning of the computer age, Monte Carlo methods have been used to evaluate integrals, solve integral equations, and simulate physical processes [7]. These methods use a sequence ofpoints, usually a deterministic pseudo-random approximation to a randomly chosen sequence, to sample the values of the integrand function or the possible steps in a process. Over the years a number of techniques, such as variance reduction through stratification, have been developed to improve the accuracy of these methods. An alternative technique is to replace the pseudo-random sequence with a deterministic sequence having better uniformity properties. Uniformity of a sequence is measured by its discrepancy, which is the error in representation of the volume of subsets of the unit cube by the fraction of points in the subsets. Several different definitions of discrepancy can be formulated [8], [14], [17], including a sup

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new permutation choice in Halton sequences

This paper has several folds. We make first new permutation choices in Halton sequences to improve their distributions. These choices are multi-dimensional and they are made for two different discrepancies. We show that multi-dimensional choices are better for standard quasi-Monte Carlo methods. We also use these sequences as a variance reduction technique in Monte Carlo methods, which greatly ...

متن کامل

An Improved Method to Extract Quasi-Random Sequences from Generalized Semi-Random Sources

In this paper, we consider new and general models for imperfect sources of randomness, and show how to obtain quasi-random sequences from such sources. Intuitively, quasi-random sequences are sequences of almost unbiased elements over a finite set. Our model is as follows: Let A be a finite set whose number of elements is a power of 2. Let 1/|A| ≤ δ < 1 be a constant. The source outputs an elem...

متن کامل

Multidimensional sampling for simulation and integration: measures, discrepancies, and quasi-random numbers

This is basically a review of the field of Quasi-Monte Carlo intended for computational physicists and other potential users of quasi-random numbers. As such, much of the material is not new, but is presented here in a style hopefully more accessible to physicists than the specialized mathematical literature. There are also some new results: On the practical side we give important empirical pro...

متن کامل

Quasi Random Deployment Strategy for Reliable Communication Backbones in Wireless Sensor Networks

Topology construction and topology maintenance are significant sub-problems of topology control. Spanning tree based algorithms for topology control are basically transmission range based type construction algorithms. The construction of an effective backbone, however, is indirectly related to the placement of nodes. Also, the dependence of network reliability on the communication path undertak...

متن کامل

Relation Between RNA Sequences, Structures, and Shapes via Variation Networks

Background: RNA plays key role in many aspects of biological processes and its tertiary structure is critical for its biological function. RNA secondary structure represents various significant portions of RNA tertiary structure. Since the biological function of RNA is concluded indirectly from its primary structure, it would be important to analyze the relations between the RNA sequences and t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Scientific Computing

دوره 15  شماره 

صفحات  -

تاریخ انتشار 1994